Evolutionary Analysis for Continuous Search Space

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Evolutionary algorithms for continuous-space optimisation

From a global viewpoint, Evolutionary Algorithms (EA) working on continuous search-spaces can be regarded as homogeneous Markov chains (MC) with discrete time and continuous state. We analyze from this viewpoint the (1+1)EA on the inclined plane fitness landscape, and derive a closed-form expression for the probability of occupancy of an arbitrary target zone, at an arbitrary iteration of the E...

متن کامل

Simulated Binary Crossover for Continuous Search Space

Abst ract . T he success of binary-coded gene t ic algorithms (GA s) in problems having discrete sear ch space largely depends on the coding used to represent the prob lem var iables and on the crossover ope ra tor that propagates buildin g blocks from parent strings to children st rings . In solving optimization problems having continuous search space, binary-coded GAs discr et ize the search ...

متن کامل

Transition Functions for Evolutionary Algorithms on Continuous State-space

Evolutionary algorithms working on continuous search space can be regarded as general homogeneous Markov chains. The finite space problem of describing the transition matrix turns into the more complicated problem of definining and estimating a transition function. We analyze in this respect the (1+1) evolutionary algorithm on the inclined plane and corridor models. In the first case, the proba...

متن کامل

A genetic algorithm for continuous design space search

Genetic algorithms (GAs) have been extensively used as a means for performing global optimization in a simple yet reliable manner. However, in some realistic engineering design optimization domains the simple, classical implementation of a GA based on binary encoding and bit mutation and crossover is often ineecient and unable to reach the global optimum. In this paper we describe a GA for cont...

متن کامل

Green Space Suitability Analysis Using Evolutionary Algorithm and Weighted Linear Combination (WLC) Method

With current new urban developments, no balance can be found between green spaces and open areas present within urban networks and natural land patterns since urban networks are dominating ecological networks. Accordingly, one of the major tasks of urban and regional planners is the optimal land use allocation to urban green spaces. Therefore, to achieve this goal in this research, locations of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Korean Institute of Intelligent Systems

سال: 2011

ISSN: 1976-9172

DOI: 10.5391/jkiis.2011.21.2.206